Quasi-abelian cayley graphs and parsons graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Finite Groups that all Their Semi-Cayley Graphs are Quasi-Abelian

In this paper, we prove that every semi-Cayley graph over a group G is quasi-abelian if and only if G is abelian.

متن کامل

NORMAL 6-VALENT CAYLEY GRAPHS OF ABELIAN GROUPS

Abstract : We call a Cayley graph Γ = Cay (G, S) normal for G, if the right regular representation R(G) of G is normal in the full automorphism group of Aut(Γ). In this paper, a classification of all non-normal Cayley graphs of finite abelian group with valency 6 was presented.  

متن کامل

Spectral estimates for Abelian Cayley graphs

We give two short proofs that for fixed d, a d-regular Cayley graph on an Abelian group of order n has second eigenvalue bounded below by d −O(dn−4/d ), where the implied constant is absolute. We estimate the constant in the O(dn−4/d ) notation. We show that for any fixed d, then for a large odd prime, n, theO(dn−4/d ) cannot be improved; more precisely, most d-regular graphs on prime n vertice...

متن کامل

Leader Election in Abelian Cayley Graphs

In this paper we consider the problem of distributed leader election in unoriented Abelian Cayley graphs of degree 4. This family of graphs, denoted by C G 4, include bidimensional tori of arbitrary size and chordal rings with one arbitrary chord. We present an algorithm which assumes that the only structural knowledge available to the nodes is “I am in an Abelian Cayley Graph of degree 4”. The...

متن کامل

Integral Quartic Cayley Graphs on Abelian Groups

A graph is called integral, if its adjacency eigenvalues are integers. In this paper we determine integral quartic Cayley graphs on finite abelian groups. As a side result we show that there are exactly 27 connected integral Cayley graphs up to 11 vertices.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 1997

ISSN: 0195-6698

DOI: 10.1006/eujc.1996.0125